A Fiat-Shamir Implementation Note
نویسندگان
چکیده
In the Micali-Shamir paper [7] improving the efficiency of the original Fiat-Shamir protocol [5,6,9], the authors state that “(. . .) not all of the vi’s will be quadratic residues mod n. We overcome this technical difficulty with an appropriate perturbation technique (. . .)” This perturbation technique is made more explicit in the associated patent application [8]: “Each entity is allowed to modify the standard vj which are QNRs. A particularly simple way to achieve this is to pick a modulus n = pq where p = 3 mod 8 and q = 7 mod 8, since then exactly one of vj , −vj , 2vj , −2vj is a QR mod n for any vj . The appropriate variant of each vj can be (. . .) deduced by the verifier himself during the verification of given signatures.” In this short note we clarify the way in which the verifier can infer by himself the appropriate variant of each vj during verification.
منابع مشابه
Feige-Fiat-Shamir Identi cation Based On Real Quadratic Fields
We describe Feige-Fiat-Shamir type identiication schemes that work in real quadratic elds. The security of those schemes relies on the diiculty of nding the generator of a given principal ideal. We present three variants, discuss the choice of parameters, explain in an al-gorithmic way how to execute the single protocol steps, and give running times and storage requirements obtained from our im...
متن کاملA Second Look at Fischlin's Transformation
Fischlin’s transformation is an alternative to the standard Fiat-Shamir transform to turn a certain class of public key identification schemes into digital signatures (in the random oracle model). We show that signatures obtained via Fischlin’s transformation are existentially unforgeable even in case the adversary is allowed to get arbitrary (yet bounded) information on the entire state of the...
متن کاملHow To Implement A Stand-alone Verifier for the Verificatum Mix-Net
Verificatum, http://www.verificatum.org, is a free and open source implementation of an El Gamal based mix-net which optionally uses the Fiat-Shamir heuristic to produce universally verifiable proofs of correctness during the execution of the protocol. This document gives a detailed description of these proofs targeting implementors of standalone verifiers.
متن کاملPost-quantum Security of Fiat-Shamir
The Fiat-Shamir construction (Crypto 1986) is an efficient transformation in the random oracle model for creating non-interactive proof systems and signatures from sigmaprotocols. In classical cryptography, Fiat-Shamir is a zero-knowledge proof of knowledge assuming that the underlying sigma-protocol has the zero-knowledge and special soundness properties. Unfortunately, Ambainis, Rosmanis, and...
متن کاملOn the (In)security of the Fiat-Shamir Paradigm
In 1986, Fiat and Shamir proposed a general method for transforming secure -round public-coin identification schemes into digital signature schemes. The idea of the transformation was to replace the random message of the verifier in the identification scheme, with the value of some deterministic“hash” function evaluated on various quantities in the protocol and on the message to be signed. The ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- IACR Cryptology ePrint Archive
دوره 2016 شماره
صفحات -
تاریخ انتشار 2016